Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
نویسندگان
چکیده
We give a bound on the expected reconstruction error for a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The result can be specialized to Kmeans clustering, nonnegative matrix factorization and the sparse coding techniques introduced by Olshausen and Field.
منابع مشابه
$G$-Frames for operators in Hilbert spaces
$K$-frames as a generalization of frames were introduced by L. Gu{a}vruc{t}a to study atomic systems on Hilbert spaces which allows, in a stable way, to reconstruct elements from the range of the bounded linear operator $K$ in a Hilbert space. Recently some generalizations of this concept are introduced and some of its difference with ordinary frames are studied. In this paper, we give a new ge...
متن کاملDimensionality-Dependent Generalization Bounds for k-Dimensional Coding Schemes
The k-dimensional coding schemes refer to a collection of methods that attempt to represent data using a set of representative k-dimensional vectors and include nonnegative matrix factorization, dictionary learning, sparse coding, k-means clustering, and vector quantization as special cases. Previous generalization bounds for the reconstruction error of the k-dimensional coding schemes are main...
متن کاملSome Properties of Continuous $K$-frames in Hilbert Spaces
The theory of continuous frames in Hilbert spaces is extended, by using the concepts of measure spaces, in order to get the results of a new application of operator theory. The $K$-frames were introduced by G$breve{mbox{a}}$vruta (2012) for Hilbert spaces to study atomic systems with respect to a bounded linear operator. Due to the structure of $K$-frames, there are many differences between...
متن کاملError bounds in approximating n-time differentiable functions of self-adjoint operators in Hilbert spaces via a Taylor's type expansion
On utilizing the spectral representation of selfadjoint operators in Hilbert spaces, some error bounds in approximating $n$-time differentiable functions of selfadjoint operators in Hilbert Spaces via a Taylor's type expansion are given.
متن کاملK -Dimensional Coding Schemes in Hilbert Spaces
Abstract. This paper presents a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The method is based on empirical risk minimization within a certain class of linear operators, which map the set of coding vectors to the Hilbert space. Two results bounding the expected reconstruction error of the method are derived, which highlight the role...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008